Results for the n-queens problem on the Möbius board
نویسندگان
چکیده
In this paper we consider the extension of the n-queens problem to the Möbius strip; that is, the problem of placing a maximum number of nonattacking queens on the m×n chessboard for which the left and right edges are twisted connected. We prove the existence of solutions for the m× n Möbius board for classes of m and n with density 25/48 in the set of all m × n Möbius boards, and show the impossibility of solutions for a set of m and n with density 1/16. We also have computed the total number of solutions for the m×m Möbius board for m from 1 to 16.
منابع مشابه
Queens on Non-square Tori
We prove that for m < n, the n × m rectangular toroidal chessboard admits gcd(m,n) nonattacking queens except in the case m = 3, n = 6. The classical n-queens problem is to place n queens on the n × n chessboard such that no pair is attacking each other. Solutions for this problem exist for all for n = 2, 3 [1]. The queens problem on a rectangular board is of little interest; on the n ×m board ...
متن کاملNew Results on the Queens_n2 Graph Coloring Problem
Given an n×n chess board, a queen graph is a graph with n vertices, each corresponding to a square of the board. Two vertices are connected by an edge if the corresponding squares are in the same row, column, or diagonals (both ascending and descending diagonals), this corresponds to the queen move rule at the chess game. The coloring problem on this graph consists in finding the minimum number...
متن کاملConstruction Through Decomposition : A Linear Time Algorithm Cor the N - queens Problem
Configuring N mutually non-attacking queens on an N-by-N chessboard is a contemporary problem that was first posed over a century ago. Over the past few decades, this problem has become important to computer scientists by serving as the standard example of backtracking search methods. A related problem, placing the N queens on a toroidal board, has been discussed in detail by Polya and Chandra,...
متن کاملA Novel Approach to Solving N-Queens Problem
Placing n mutually non-attacking queens on an n by n chessboard is a classical problem in the artificial intelligence (AI) area. Over the past few decades, this problem has become important to computer scientists for providing solutions to many useful and practical applications. In this paper, we present a novel approach to solving the n-queens problem in a considerably less execution time. The...
متن کاملOrdered Greed for N SuperQueens
This is an extension of the Ordered Greed technique introduced by Anderson and Gustafson in [1]. The Ordered Greed algorithm (OG) is a hybrid greedy algorithm using permutations. OG is applicable to many classical optimization problems, including job assignment, graph coloring, bin packing, and satisfiability. Here, OG is applied to a variant of the N Queens problem, the N SuperQueens problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 42 شماره
صفحات -
تاریخ انتشار 2008